A Unified Framework for Small Secret Exponent Attack on RSA
نویسندگان
چکیده
منابع مشابه
A Unified Framework for Small Secret Exponent Attack on RSA
We address a lattice based method on small secret exponent attack on RSA scheme. Boneh and Durfee reduced the attack into finding small roots of a bivariate modular equation: x(N+1+y)+1 ≡ 0( mod e), where N is an RSA moduli and e is the RSA public key. Boneh and Durfee proposed a lattice based algorithm for solving the problem. When the secret exponent d is less than N, their method breaks RSA ...
متن کاملShort secret exponent attack on LSBS-RSA
LSBS-RSA is a variation of RSA cryptosystem with modulus primes p, q, sharing a large number of least significant bits. As original RSA, LSBS-RSA is also vulnerable to the short secret exponent attack. Sun et al. [15] studied this problem and they provided the bound for secret exponent as: 2 2 5 4 3 1 6 1 3 6 3 2 2 6 γ β α α γ α − < + − + − − . Their bound does not reduce to the opt...
متن کاملPower Attack on Small RSA Public Exponent
In this paper, we present a new attack on RSA when the public exponent is short, for instance 3 or 2+1, and when the classical exponent randomization is used. This attack works even if blinding is used on the messages. From a Simple Power Analysis (SPA) we study the problem of recovering the RSA private key when non consecutive bits of it leak from the implementation. We also show that such inf...
متن کاملSmall secret exponent attack on RSA variant with modulus N=prq
We consider an RSA variant with Modulus N = p2q. This variant is known as Prime Power RSA. In PKC 2004 May proved when decryption exponent d < N0.22, one can factor N in polynomial time. In this paper, we improve this bound upto N0.395. We provide detailed experimental results to justify our claim.
متن کاملLow Secret Exponent RSA Revisited
We present a lattice attack on low exponent RSA with short secret exponent d = N for every δ < 0.29. The attack is a variation of an approach by Boneh and Durfee [4] based on lattice reduction techniques and Coppersmith’s method for finding small roots of modular polynomial equations. Although our results are slightly worse than the results of Boneh and Durfee they have several interesting feat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2014
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e97.a.1285